Coordinate Blinding over Large Prime Fields
نویسندگان
چکیده
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies to elliptic curves in the short Weierstraß form over large prime fields. The described countermeasure is shown to be a generalization of the use of random curve isomorphisms to prevent side-channel analysis, and our best configuration of this countermeasure is shown to be equivalent to the use of random curve isomorphisms. Furthermore, we describe how this countermeasure, and therefore random curve isomorphisms, can be efficiently implemented using Montgomery multiplication.
منابع مشابه
Structure of finite wavelet frames over prime fields
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
متن کاملEfficient Side-Channel Attacks on Scalar Blinding on Elliptic Curves with Special Structure
In this paper we introduce two new generic sidechannel attacks on scalar blinding of elliptic curves where the order of the base point is close to a power of 2. These attacks are in particu lar relevant for elliptic curves over special prime fields where the prime is ’almost’ a power of 2. As in the papers [9, 10] we assume that some side-channel attack has allowed the determina tion of the b...
متن کاملConstructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. Our algorithm works for arbitrary embedding degrees k and prime subgroup orders r. The resulting abelian surfaces are defined over prime fields Fq with q ≈ r. We also provide an algorithm for constructing genus 2 curves ...
متن کاملParallelization of the Wiedemann Large Sparse System Solver over Large Prime Fields For the partial fulfilment of the degree of Master of Technology
The discrete logarithm problem over finite fields serves as the source of security for several cryptographic primitives. The fastest known algorithms for solving the discrete logarithm problem require solutions of large sparse linear systems over large prime fields, and employ iterative solvers for this purpose. The published results on this topic are mainly focused on systems over binary field...
متن کاملCounting Points for Hyperelliptic Curves of Type y2= x5 + ax over Finite Prime Fields
Counting rational points on Jacobian varieties of hyperelliptic curves over finite fields is very important for constructing hyperelliptic curve cryptosystems (HCC), but known algorithms for general curves over given large prime fields need very long running times. In this article, we propose an extremely fast point counting algorithm for hyperelliptic curves of type y = x + ax over given large...
متن کامل